Learning-based importance sampling via stochastic optimal control for stochastic reaction networks
نویسندگان
چکیده
Abstract We explore efficient estimation of statistical quantities, particularly rare event probabilities, for stochastic reaction networks. Consequently, we propose an importance sampling (IS) approach to improve the Monte Carlo (MC) estimator efficiency based on approximate tau-leap scheme. The crucial step in IS framework is choosing appropriate change probability measure achieve substantial variance reduction. This task typically challenging and often requires insights into underlying problem. Therefore, automated obtain a highly path-dependent original connection network context between finding optimal parameters within class measures control formulation. Optimal are obtained by solving minimization First, derive associated dynamic programming equation. Analytically this backward equation challenging, hence formulation find near-optimal parameters. To mitigate curse dimensionality, learning-based method value function using neural network, where determined via optimization algorithm. Our analysis numerical experiments verify that proposed substantially reduces MC variance, resulting lower computational complexity regime, compared with standard estimators.
منابع مشابه
Sampling-based Algorithms for Stochastic Optimal Control
Controlling dynamical systems in uncertain environments is fundamental and essential in several fields, ranging from robotics, healthcare to economics and finance. In these applications, the required tasks can be modeled as continuous-time, continuous-space stochastic optimal control problems. Moreover, risk management is an important requirement of such problems to guarantee safety during the ...
متن کاملAn Environment for Importance Sampling Based on Stochastic Activity Networks
Model-based evaluation of reliable distributed and parallel systems is diicult due to the complexity of these systems and the nature of the dependability measures of interest. The complexity creates problems for analytical model solution techniques, and the fact that reliability and availability measures are based on rare events makes traditional simulation methods inee-cient. Importance sampli...
متن کاملAdaptive Importance Sampling via Stochastic Convex Programming
We show that the variance of the Monte Carlo estimator that is importance sampled from an exponential family is a convex function of the natural parameter of the distribution. With this insight, we propose an adaptive importance sampling algorithm that simultaneously improves the choice of sampling distribution while accumulating a Monte Carlo estimate. Exploiting convexity, we prove that the m...
متن کاملOptimal Control of Stochastic Networks - an Approach via Fluid Models
We consider a general control problem for networks which includes the special cases of scheduling in multiclass queueing networks and routing problems. The fluid approximation of the network is used to derive new results about the optimal control for the stochastic network. The main emphasis lies on the average cost criterion, however the β-discounted as well as the finite cost problem are also...
متن کاملOptimal Importance Sampling Parameter Search for Lévy Processes via Stochastic Approximation
The author proposes stochastic approximation methods of finding the optimal measure change by the exponential tilting for Lévy processes in Monte Carlo importance sampling variance reduction. In accordance with the structure of the underlying Lévy measure, either a constrained or unconstrained algorithm of the stochastic approximation is chosen. For both cases, the almost sure convergence to a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Computing
سال: 2023
ISSN: ['0960-3174', '1573-1375']
DOI: https://doi.org/10.1007/s11222-023-10222-6